On-Line Scheduling for Jobs with Arbitrary Release Times on Parallel Related Uniform Machines
نویسندگان
چکیده
منابع مشابه
On-line Scheduling on Identical Machines for Jobs with Arbitrary Release Times
In the theory of scheduling, a problem type is categorized by its machine environment, job characteristic and objective function. According to the way information on job characteristic being released to the scheduler, scheduling models can be classified in two categories. One is termed off-line in which the scheduler has full information of the problem instance, such as the total number of jobs...
متن کاملScheduling jobs on parallel machines with sequence-dependent setup times
The study considers the scheduling problem of identical parallel machines subject to minimization of the maximumcompletion time and the maximum tardiness expressed in a linear convex objective function. The maximum completiontime or makespan is the date when the last job to be completed leaves the system. The maximum tardiness is indicated bythe job that is completed with the lo...
متن کاملA simple algorithm for scheduling equal sized jobs on parallel machines with release times and deadlines
Given n jobs of equal processing time p, we wish to find a schedule on m parallel machines, where each job j is scheduled in a given interval [rj , Dj). This problem can be solved in time O(n logn) by a complicated algorithm by Simons from 1978. Recently Brucker and Kravchenko (2005), gave a different algorithm for it. Based in their approach we provide an O(n) algorithm for the problem, which ...
متن کاملOn-line scheduling of parallel jobs on two machines
We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case 1 or 2, required for simultaneous processing. The jobs are presented one by one. Upon receiving a job, we must assign the job to a time slot in the schedule before the next job is presented. No re-assignment is allowed...
متن کاملFlowshop scheduling with identical jobs and uniform parallel machines
The single-stage scheduling problem to minimize the makespan of identical jobs on uniform parallel machines is known to be solvable in polynomial-time. We extend this work to consider multi-stage systems with flowshop configuration. We show that the 2-stage problem may also be solved in polynomial-time and for the number of stages greater than two, the problem is shown to be NP-hard. We present...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Intelligent Information Management
سال: 2016
ISSN: 2160-5912,2160-5920
DOI: 10.4236/iim.2016.84008